Secondary teachers' assessment and grading practices in inclusive classrooms

The assessment reform movement has focused on classroom assessment and grading practices as a potential means to improving teaching and learning. Many researchers agree that the best way to enhance learning for a diverse range of students is through appropriate, reliable, and valid classroom assessment and grading practices. This is of particular importance in Saskatchewan because the inclusive philosophy has been mandated for all schools. Classroom teachers are responsible for the instruction, assessment, and grading of students with mild disabilities, learning, emotional, and behavioral challenges, and other needs that require specific attention. This study examined secondary classroom teachers’ assessment and grading practices in one urban school division. A survey instrument adapted from the work of Duncan and Noonan (2007) and McMillan (2001) asked current secondary teachers, within inclusive classrooms, to indicate their current assessment and grading practices. Evidence from the survey demonstrated that teachers in this division have diverse assessment and grading practices and that they have begun to explore the potential for assessment to assist all students in their learning. This study has provided data to move forward with some professional development opportunities for teachers and further research in assessment and grading with particular focus on students with special needs in inclusive classrooms

Parameterized Edge Hamiltonicity

We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke

NLC-2 graph recognition and isomorphism

NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust $O(n^2 m)$-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.Comment: soumis \`{a} WG 2007; 12

The Effect of Planarization on Width

We study the effects of planarization (the construction of a planar diagram $D$ from a non-planar graph $G$ by replacing each crossing by a new vertex) on graph width parameters. We show that for treewidth, pathwidth, branchwidth, clique-width, and tree-depth there exists a family of $n$-vertex graphs with bounded parameter value, all of whose planarizations have parameter value $\Omega(n)$. However, for bandwidth, cutwidth, and carving width, every graph with bounded parameter value has a planarization of linear size whose parameter value remains bounded. The same is true for the treewidth, pathwidth, and branchwidth of graphs of bounded degree.Comment: 15 pages, 6 figures. To appear at the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Remoção de fósforo de efluentes da suinocultura.

Projeto/Plano de Ação: 03.11.09.01

Tecnologias para tratamento de dejeto de suínos.

Projeto/Plano de Ação: 03.11.09.012

Azumaya Objects in Triangulated Bicategories

We introduce the notion of Azumaya object in general homotopy-theoretic settings. We give a self-contained account of Azumaya objects and Brauer groups in bicategorical contexts, generalizing the Brauer group of a commutative ring. We go on to describe triangulated bicategories and prove a characterization theorem for Azumaya objects therein. This theory applies to give a homotopical Brauer group for derived categories of rings and ring spectra. We show that the homotopical Brauer group of an Eilenberg-Mac Lane spectrum is isomorphic to the homotopical Brauer group of its underlying commutative ring. We also discuss tilting theory as an application of invertibility in triangulated bicategories.Comment: 23 pages; final version; to appear in Journal of Homotopy and Related Structure

Alternative therapies for GERD : a way to personalized antireflux surgery

Gastroesophageal reflux disease (GERD) is a commondisorder, known to affect about20%of theWestern population. Although conventional medical or surgical treatment has proven effective, there is certainly room for improvements. As only 10% of GERD patients are finally treated by antireflux surgery, a large therapeutic window exists. This treatment gap consists of patients who are not effectively treated with proton pump inhibitor but do not want to run the potential risks of conventional surgery. During the last two decades, several novel and intriguing options for the surgical treatment of GERD have been introduced and found their way into clinical use. The following summary will give an update of certain alternative therapeutic options to treat GERD or its pathological consequences

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether a given graph G allows a homomorphism to a given graph H that is locally bijective, surjective, or injective, respectively, are NP-complete, even when G has pathwidth at most 5, 4 or 2, respectively, or when both G and H have maximum degree 3. We complement these hardness results by showing that the three problems are polynomial-time solvable if G has bounded treewidth and in addition G or H has bounded maximum degree